A strong mixing condition for second-order stationary random fields

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Central limit theorems for Hilbert-space valued random fields satisfying a strong mixing condition

In this paper we study the asymptotic normality of the normalized partial sum of a Hilbert-space valued strictly stationary random field satisfying the interlaced ρ-mixing condition.

متن کامل

Strong Spatial Mixing for Binary Markov Random Fields

The remarkable contribution by Weitz gives a general framework to establish the strong spatial mixing property of Gibbs measures. In light of Weitz’s work, we prove the strong spatial mixing for binary Markov random fields under the condition that the ‘external field’ is uniformly large or small by turning them into a corresponding Ising model. Our proof is done through a ‘path’ characterizatio...

متن کامل

A Coarsening of the Strong Mixing Condition

Let {Xt : t ∈ Z} be a collection of random variables defined on some probability space (Ω,F , P ). Mixing conditions provide one way to formalize the notion that these random variables are only weakly dependent on one another. There are many ways to define mixing; the monographs by Doukhan [8] and Bradley [5] list five classical definitions. The oldest and most general of these is the α-mixing ...

متن کامل

Symbolic computations for random fields using second order perturbation method

The main idea is to show the application of symbolic computations in analysis of engineering systems with random parameters. The general computational methodology is based on the stochastic second order perturbation method and its implementation in the mathematical package MAPLE 6. The entire approach is displayed on the example of simple single degree of freedom dynamical system with random sp...

متن کامل

Efficient Second-Order Gradient Boosting for Conditional Random Fields

Conditional random fields (CRFs) are an important class of models for accurate structured prediction, but effective design of the feature functions is a major challenge when applying CRF models to real world data. Gradient boosting, which is used to automatically induce and select feature functions, is a natural candidate solution to the problem. However, it is non-trivial to derive gradient bo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Studia Mathematica

سال: 1992

ISSN: 0039-3223,1730-6337

DOI: 10.4064/sm-101-2-139-153